Constraint satisfaction using soft quantifiers

نویسنده

  • Ronald R. Yager
چکیده

Ronald R. Yager Machine Intelligence Institute, Iona College New Rochelle, NY 10801 [email protected] (212)249-2047 ABSTRACT Fuzzy sets and other methods have been used to model a softening of constraints in CP problems. Here we suggest an approach to the softening of the CP problem at the meta level, the process used to aggregate the satisfactions to the individual constraints. We suggest the use of soft quantifiers such as "most" to guide the process of aggregating the satisfactions to the individual constraints. Use is made of the ability to represent these soft quantifiers by fuzzy sets and the ability to implement their authorized aggregation by the OWA operator.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Working Papers of the IJCAI-2013 Workshop on Weighted Logics for Artificial Intelligence

Quantifiers have the ability of summarizing the properties of a class of objects without enumerating them. This talk introduces a framework for modeling quantifiers in natural languages in which each linguistic quantifier is represented by a family of non-additive measures, and the truth value of a quantified proposition is evaluated by using Sugeno’s integral. Some elegant logical properties o...

متن کامل

Galois correspondence for counting quantifiers

We introduce a new type of closure operator on the set of relations, max-implementation, and its weaker analog max-quantification. Then we show that approximation preserving reductions between counting constraint satisfaction problems (#CSPs) are preserved by these two types of closure operators. Together with some previous results this means that the approximation complexity of counting CSPs i...

متن کامل

Consistencies for Ultra-Weak Solutions in Minimax Weighted CSPs Using the Duality Principle

Minimax Weighted Constraint Satisfaction Problems (formerly called QWCSPs) are a framework for modeling soft constrained problems with adversarial conditions. In this paper, we describe novel definitions and implementations of node, arc and full directional arc consistency notions to help reduce search space on top of the basic tree search with alpha-beta pruning for solving ultraweak solutions...

متن کامل

COMBINING FUZZY QUANTIFIERS AND NEAT OPERATORS FOR SOFT COMPUTING

This paper will introduce a new method to obtain the order weightsof the Ordered Weighted Averaging (OWA) operator. We will first show therelation between fuzzy quantifiers and neat OWA operators and then offer anew combination of them. Fuzzy quantifiers are applied for soft computingin modeling the optimism degree of the decision maker. In using neat operators,the ordering of the inputs is not...

متن کامل

Constraint Satisfaction with Counting Quantifiers

We initiate the study of constraint satisfaction problems (CSPs) in the presence of counting quantifiers ∃ which assert the existence of at least j elements such that the ensuing property holds. These are natural variants of CSPs in the mould of quantified CSPs (QCSPs). Namely, ∃ := ∃ and ∃ := ∀ (for the domain of size n) We observe that a single counting quantifier ∃ strictly between ∃ and ∀ a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Int. Syst. in Accounting, Finance and Management

دوره 12  شماره 

صفحات  -

تاریخ انتشار 2004